soundex
An algorithm for encoding a word so that similar sounding words encode the same. The first letter is copied unchanged then subsequent letters are encoded as follows: bfpv -> "1" cgjkqsxzç -> "2" dt -> "3" l -> "4" mnñ -> "5" r -> "6" Other characters are ignored and repeated characters are encoded as though they were a single character. Encoding stops when the resulting string is four characters long, adding trailing "0"s if it is shorter. For example, "SMITH" or "SMYTHE" would both be encoded as "S530". (1995-01-05) In addition suitable contents:
[ 2 ] [ = ] [ ad ] [ ai ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ be ] [ bf ] [ bo ] [ bot ] [ bs ] [ cg ] [ ch ] [ char ] [ character ] [ co ] [ code ] [ dd ] [ de ] [ ding ] [ du ] [ E ] [ ed ] [ encode ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ fo ] [ for ] [ ge ] [ gh ] [ gl ] [ gn ] [ h ] [ hang ] [ hat ] [ hm ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ ir ] [ is ] [ IT ] [ it ] [ la ] [ ld ] [ Lex ] [ li ] [ lt ] [ M ] [ mil ] [ MIT ] [ mn ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ng ] [ no ] [ O ] [ op ] [ pe ] [ ph ] [ pl ] [ query ] [ rc ] [ re ] [ repeat ] [ S ] [ sa ] [ sam ] [ se ] [ sh ] [ si ] [ SMI ] [ so ] [ sound ] [ st ] [ string ] [ su ] [ T ] [ ] [ text ] [ th ] [ to ] [ tr ] [ tt ] [ ug ] [ word ] [ ws ] [ Y ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (3456 Reads) |
