Existing search heuristics used to find input values that result in significant floating-point (FP) errors or small ranges that cover them are accompanied by severe constraints, complicating their implementation and restricting their general applicability. This paper introduces an error analysis tool called EIFFEL to infer error-inducing input ranges instead of searching them. Given an FP expression with its domain D, EIFFEL first constructs an error data set by sampling values across a smaller domain R and assembles these data into clusters. If more than two clusters are formed, EIFFEL derives polynomial curves that best fit the bound coordinates of the error-inducing ranges in R, extrapolating them to infer all target ranges of D and reporting the maximal error. Otherwise, EIFFEL simply returns the largest error across R. Experimental results show that EIFFEL exhibits a broader applicability than ATOMU and S3FP by successfully detecting the errors of all 70 considered benchmarks while the two baselines only report errors for part of them. By taking as input the inferred ranges of EIFFEL, Herbie obtains an average accuracy improvement of 3.35 bits and up to 53.3 bits.