Statistics

Problem Statement for "Speller"

Problem Statement

I need software that can read written numbers and convert them to integers. The numbers are always between 1 and 99 inclusive, but may be misspelled. The correct spelling of numbers is given by the following grammar, in which '<' '>' '::=' and '|' are metacharacters and all others are literal:
  • <NUMBER> ::= <ONES> | <TEEN> | <TENS> | <TENS>-<ONES>
  • <ONES> ::= one | two | three | four | five | six | seven | eight | nine
  • <TEEN> ::= ten | eleven | twelve | thirteen | fourteen | fifteen | sixteen | seventeen | eighteen | nineteen
  • <TENS> ::= twenty | thirty | forty | fifty | sixty | seventy | eighty | ninety
Create a class Speller that contains a method value that is given a String number and that returns the integer value whose correct spelling is closest to number. The distance between two spellings is defined to be the number of characters in one of the spellings that would need to be changed to a different character in order to make them match, where matching is case sensitive. Two spellings of different lengths are considered to be infinitely far apart.

The method should return -1 if there is more than one value that is closest to number.

Definition

Class:
Speller
Method:
value
Parameters:
String
Returns:
int
Method signature:
int value(String number)
(be sure your method is public)

Constraints

  • number will contain between 1 and 20 characters inclusive.
  • Each character in number will be between ASCII 33 and ASCII 126 inclusive.

Examples

  1. "forty-two"

    Returns: 42

  2. "FORTY-TWO"

    Returns: -1

    "forty-two" and " fifty-two" are both a distance of 8 from "FORTY-TWO". No other number is closer.

  3. "eightene"

    Returns: 18

    "eighteen" is 2 misspelled letters away from "eightene"

  4. "one-hundred"

    Returns: -1

  5. "fifty-fifty"

    Returns: 58

  6. "fi"

    Returns: -1

    All numbers are infinitely far away, since there are no 2 character strings that represent numbers.

  7. "thirty"

    Returns: 30

  8. "fortytwo"

    Returns: 14

  9. "@-x"

    Returns: 6

  10. "f#$!"

    Returns: -1

  11. "f()e"

    Returns: 5

  12. "abcdefghejklm"

    Returns: 78

  13. "abcdefghijkl"

    Returns: -1

  14. "abcdefeeeee"

    Returns: -1

  15. "a-cndefgwi"

    Returns: 22

  16. "42"

    Returns: -1

  17. "thirty-fiur"

    Returns: 34

  18. "ninety-fine"

    Returns: -1

  19. "nin***-nine"

    Returns: 99

  20. "two-twenty"

    Returns: -1

  21. "four-fourty"

    Returns: 43

  22. "six-ninety"

    Returns: 69

  23. "six-seven"

    Returns: -1

  24. "four-eleven"

    Returns: 47

  25. "forty-two"

    Returns: 42

  26. "eighty-one"

    Returns: 81

  27. "seven-een"

    Returns: 17

  28. "zero"

    Returns: -1

  29. "twentyxsix"

    Returns: 26

  30. "th-rty-four"

    Returns: 34

  31. "fortyatwo"

    Returns: 42

  32. "twenty"

    Returns: 20

  33. "FORTY-TWO"

    Returns: -1

  34. "ninete"

    Returns: 90

  35. "three"

    Returns: 3

  36. "sev-nty"

    Returns: 70

  37. "o"

    Returns: -1

  38. "fiver"

    Returns: -1

This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2024, TopCoder, Inc. All rights reserved.
This problem was used for: