Knowledge

Phonetic algorithm

Source đź“ť

273: 146:
functionality will often use phonetic algorithms to find results that don't match exactly the term(s) used in the search. Searching for names can be difficult as there are often multiple alternative spellings for names. An example is the name
139:
algorithm, for example, can take an incorrectly spelled word and create a code. The code is then looked up in directory for words with the same or similar Metaphone. Words that have the same or similar Metaphone become possible alternative
277: 58:
varies significantly depending on multiple factors, such as the word's origin and usage over time and borrowings from other languages, phonetic algorithms necessarily take into account numerous rules and exceptions.
103: 80:, which is a refinement of Soundex designed to better match surnames of Slavic and Germanic origin. Daitch–Mokotoff Soundex codes are strings composed of six numeric digits. 215:
Exploring the grand challenges for next generation E-Business : 8th Workshop on E-Business, WEB 2009, Phoenix, AZ, USA, December 15, 2009, Revised selected papers
288: 122:, created to assist in data matching between late 19th century and early 20th century electoral rolls, optimized for accents present in parts of New Zealand. 74:, which was developed to encode surnames for use in censuses. Soundex codes are four-character strings composed of a single letter followed by three numbers. 151:. It has two alternatives, Clare/Clair, which are both pronounced the same. Searching for one spelling wouldn't show results for the two others. Using 167:
modules use phonetic encoding to find the set of dictionary words that are pronounced similarly to the phonemes output by the processed audio signal.
257: 155:
all three variations produce the same Soundex code, C460. By searching names based on the Soundex code all three variations will be returned.
223: 308: 192: 364: 96:
which are suitable for use with most English words, not just names. Metaphone algorithms are the basis for many popular
77: 177: 161:
efforts use phonetic algorithms to easily bucket records into groups of similar sounding names for further evaluation.
212:
Li, Nan; Hitchcock, Peter; Blustein, James; Bliemel, Michael (2011). H. Raghav Rao; Raj Sharman; T. S. Raghu (eds.).
318: 338: 143: 113: 116:
developed by Western Airlines in 1977 - this algorithm has an encoding and range comparison technique.
187: 55: 369: 158: 110:
to the same letter. The result is a string that can be pronounced by the reader without decoding.
39: 253: 247: 219: 213: 83: 182: 93: 51: 17: 283: 164: 132: 97: 344: 358: 47: 334: 348: 119: 324: 136: 89: 35: 107: 148: 351:
library collecting various phonetic algorithms that one can try online.
328: 314: 152: 71: 54:
and are not useful for indexing words in other languages. Because
86:: This is similar to Soundex, but more suitable for German words. 293: 43: 252:. Santa Rosa, Calif.: Informing Science. p. 498. 27:
Algorithm for indexing of words by their pronunciation
104:
New York State Identification and Intelligence System
67:Among the best-known phonetic algorithms are: 50:. Most phonetic algorithms were developed for 337:library of phonetic algorithm implemented in 8: 289:Dictionary of Algorithms and Data Structures 135:can often contain phonetic algorithms. The 204: 7: 25: 218:. Berlin: Springer. p. 232. 276: This article incorporates 271: 331:library of phonetic algorithms. 321:library of phonetic algorithms. 1: 106:(NYSIIS), which maps similar 309:converting words to phonemes 193:Damerau–Levenshtein distance 249:Growing Information: Part 2 178:Approximate string matching 18:Phonetic matching algorithm 386: 78:Daitch–Mokotoff Soundex 278:public domain material 246:Cohen, Eli B. (2009). 114:Match Rating Approach 315:StringMetric project 188:Levenshtein distance 365:Phonetic algorithms 159:Data deduplication 32:phonetic algorithm 325:clj-fuzzy project 284:"phonetic coding" 259:978-1-932886-17-7 84:Cologne phonetics 16:(Redirected from 377: 297: 275: 274: 264: 263: 243: 237: 236: 234: 232: 209: 183:Hamming distance 94:Double Metaphone 56:English spelling 21: 385: 384: 380: 379: 378: 376: 375: 374: 355: 354: 304: 282:Paul E. Black. 281: 272: 268: 267: 260: 245: 244: 240: 230: 228: 226: 211: 210: 206: 201: 174: 129: 65: 28: 23: 22: 15: 12: 11: 5: 383: 381: 373: 372: 367: 357: 356: 353: 352: 342: 332: 322: 312: 307:Algorithm for 303: 302:External links 300: 299: 298: 266: 265: 258: 238: 224: 203: 202: 200: 197: 196: 195: 190: 185: 180: 173: 170: 169: 168: 165:Speech to text 162: 156: 141: 133:Spell checkers 128: 125: 124: 123: 117: 111: 101: 98:spell checkers 87: 81: 75: 64: 61: 26: 24: 14: 13: 10: 9: 6: 4: 3: 2: 382: 371: 368: 366: 363: 362: 360: 350: 346: 343: 340: 336: 333: 330: 326: 323: 320: 316: 313: 310: 306: 305: 301: 295: 291: 290: 285: 279: 270: 269: 261: 255: 251: 250: 242: 239: 227: 225:9783642174483 221: 217: 216: 208: 205: 198: 194: 191: 189: 186: 184: 181: 179: 176: 175: 171: 166: 163: 160: 157: 154: 150: 145: 142: 138: 134: 131: 130: 126: 121: 118: 115: 112: 109: 105: 102: 99: 95: 91: 88: 85: 82: 79: 76: 73: 70: 69: 68: 62: 60: 57: 53: 49: 48:pronunciation 45: 41: 37: 33: 19: 287: 248: 241: 229:. Retrieved 214: 207: 66: 31: 29: 231:31 December 127:Common uses 359:Categories 349:JavaScript 199:References 140:spellings. 120:Caverphone 63:Algorithms 370:Phonology 335:SoundexBR 311:and back. 137:Metaphone 90:Metaphone 46:by their 36:algorithm 345:Talisman 172:See also 108:phonemes 40:indexing 329:Clojure 153:Soundex 72:Soundex 52:English 256:  222:  149:Claire 144:Search 34:is an 319:Scala 280:from 44:words 294:NIST 254:ISBN 233:2020 220:ISBN 92:and 38:for 42:of 361:: 347:a 327:a 317:a 292:. 286:. 30:A 341:. 339:R 296:. 262:. 235:. 100:. 20:)

Index

Phonetic matching algorithm
algorithm
indexing
words
pronunciation
English
English spelling
Soundex
Daitch–Mokotoff Soundex
Cologne phonetics
Metaphone
Double Metaphone
spell checkers
New York State Identification and Intelligence System
phonemes
Match Rating Approach
Caverphone
Spell checkers
Metaphone
Search
Claire
Soundex
Data deduplication
Speech to text
Approximate string matching
Hamming distance
Levenshtein distance
Damerau–Levenshtein distance
Exploring the grand challenges for next generation E-Business : 8th Workshop on E-Business, WEB 2009, Phoenix, AZ, USA, December 15, 2009, Revised selected papers
ISBN

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.

↑