Phonetic algorithm - Revision history

Jussi Karlgren: added some early references

2025-03-04T14:59:39Z

added some early references

← Previous revision		Revision as of 14:59, 4 March 2025
Line 1:		Line 1:
	{{Short description\|Algorithm for indexing of words by their pronunciation}}		{{Short description\|Algorithm for indexing of words by their pronunciation}}
	A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. ~~Most~~ phonetic algorithms were developed for [[English language\|English]] ~~and~~ are ~~not~~ useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://books.google.com/books?id=cZvDnVVmI98C&pg=PA232\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483 \|editor=H. Raghav Rao \|editor2=Raj Sharman \|editor3=T. S. Raghu \|location=Berlin\|page=232\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://books.google.com/books?id=t7RDjagG1FAC&pg=PA498 \|language=en}}</ref>		A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. If the algorithm is based on orthography, it depends crucially on the spelling system of the language it is designed for: as most phonetic algorithms were developed for [[English language\|English]] they are less useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://books.google.com/books?id=cZvDnVVmI98C&pg=PA232\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483 \|editor=H. Raghav Rao \|editor2=Raj Sharman \|editor3=T. S. Raghu \|location=Berlin\|page=232\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://books.google.com/books?id=t7RDjagG1FAC&pg=PA498 \|language=en}}</ref> More general phonetic matching algorithms take articulatory features into account <ref>Ladefoged, Peter. [https://aclanthology.org/C69-5701.pdf "The measurement of phonetic similarity."] In International Conference on Computational Linguistics COLING 1969: Preprint No. 57. 1969.</ref>

			Phonetic search has many applications, and one of the early use cases has been that of trademark search to ensure that newly registered trade marks do not risk infringing on existing trademarks by virtue of their pronunciation. <ref>McAllister, Robert, and Benny Brodda. "Development of a new speech comprehension test with a phonological distance metric." In Proceedings of Fonetik, vol. 44, pp. 149-152. 2002.</ref><ref>Fall, Caspas J., and Christophe Giraud-Carrier. "Searching trademark databases for verbal similarities." World Patent Information 27, no. 2 (2005): 135-143.</ref>

	==Algorithms==		==Algorithms==

2406:D501:F:DEB:0:0:0:A01E: /* Common uses */Updated broken data deduplication link to the right one

2024-05-06T10:50:47Z

Common uses: Updated broken data deduplication link to the right one

← Previous revision		Revision as of 10:50, 6 May 2024
Line 16:		Line 16:
	* [[Spell checkers]] can often contain phonetic algorithms. The [[Metaphone]] 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 spellings.		* [[Spell checkers]] can often contain phonetic algorithms. The [[Metaphone]] 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 spellings.
	* [[Search engine technology\|Search]] 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 [[wikt:Claire\|Claire]]. 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 [[Soundex]] all three variations produce the same Soundex code, C460. By searching names based on the Soundex code all three variations will be returned.		* [[Search engine technology\|Search]] 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 [[wikt:Claire\|Claire]]. 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 [[Soundex]] all three variations produce the same Soundex code, C460. By searching names based on the Soundex code all three variations will be returned.
	* [[Data ~~Deduplication~~]] efforts use phonetic algorithms to easily bucket records into groups of similar sounding names for further evaluation.		* [[Data deduplication]] efforts use phonetic algorithms to easily bucket records into groups of similar sounding names for further evaluation.
	* [[Speech to text]] modules use phonetic encoding to find the set of dictionary words that are pronounced similarly to the phonemes output by the processed audio signal.		* [[Speech to text]] modules use phonetic encoding to find the set of dictionary words that are pronounced similarly to the phonemes output by the processed audio signal.

2600:1700:9580:C6B0:FD4D:E1CD:756E:9003: /* Common uses */added examples of uses for phonetic algorithms

2024-03-05T08:11:32Z

Common uses: added examples of uses for phonetic algorithms

← Previous revision		Revision as of 08:11, 5 March 2024
Line 16:		Line 16:
	* [[Spell checkers]] can often contain phonetic algorithms. The [[Metaphone]] 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 spellings.		* [[Spell checkers]] can often contain phonetic algorithms. The [[Metaphone]] 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 spellings.
	* [[Search engine technology\|Search]] 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 [[wikt:Claire\|Claire]]. 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 [[Soundex]] all three variations produce the same Soundex code, C460. By searching names based on the Soundex code all three variations will be returned.		* [[Search engine technology\|Search]] 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 [[wikt:Claire\|Claire]]. 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 [[Soundex]] all three variations produce the same Soundex code, C460. By searching names based on the Soundex code all three variations will be returned.
			* [[Data Deduplication]] efforts use phonetic algorithms to easily bucket records into groups of similar sounding names for further evaluation.
			* [[Speech to text]] modules use phonetic encoding to find the set of dictionary words that are pronounced similarly to the phonemes output by the processed audio signal.

	== See also ==		== See also ==

Hulmem: Adding local short description: "Algorithm for indexing of words by their pronunciation", overriding Wikidata description "algorithm for indexing of words by their pronunciation"

2023-11-01T14:27:42Z

Adding local short description: "Algorithm for indexing of words by their pronunciation", overriding Wikidata description "algorithm for indexing of words by their pronunciation"

← Previous revision		Revision as of 14:27, 1 November 2023
Line 1:		Line 1:
			{{Short description\|Algorithm for indexing of words by their pronunciation}}
	A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. Most phonetic algorithms were developed for [[English language\|English]] and are not useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://books.google.com/books?id=cZvDnVVmI98C&pg=PA232\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483 \|editor=H. Raghav Rao \|editor2=Raj Sharman \|editor3=T. S. Raghu \|location=Berlin\|page=232\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://books.google.com/books?id=t7RDjagG1FAC&pg=PA498 \|language=en}}</ref>		A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. Most phonetic algorithms were developed for [[English language\|English]] and are not useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://books.google.com/books?id=cZvDnVVmI98C&pg=PA232\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483 \|editor=H. Raghav Rao \|editor2=Raj Sharman \|editor3=T. S. Raghu \|location=Berlin\|page=232\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://books.google.com/books?id=t7RDjagG1FAC&pg=PA498 \|language=en}}</ref>

Citation bot: Alter: url. URLs might have been anonymized. | Use this bot. Report bugs. | Suggested by AManWithNoPlan | #UCB_CommandLine

2023-03-21T06:56:36Z

Alter: url. URLs might have been anonymized. | Use this bot. Report bugs. | Suggested by AManWithNoPlan | #UCB_CommandLine

← Previous revision		Revision as of 06:56, 21 March 2023
Line 1:		Line 1:
	A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. Most phonetic algorithms were developed for [[English language\|English]] and are not useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://~~www~~.google.com/books~~/edition/Exploring_the_Grand_Challenges_for_Next/cZvDnVVmI98C~~?hl=~~en&gbpv=1~~&pg=PA232~~&printsec=frontcover~~\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483 \|editor=H. Raghav Rao \|editor2=Raj Sharman \|editor3=T. S. Raghu \|location=Berlin\|page=232\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://~~www~~.google.com/books~~/edition/Growing_Information_Part_2/t7RDjagG1FAC~~?hl=en&pg=PA498~~&printsec=frontcover~~ \|language=en}}</ref>		A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. Most phonetic algorithms were developed for [[English language\|English]] and are not useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://books.google.com/books?id=cZvDnVVmI98C&pg=PA232\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483 \|editor=H. Raghav Rao \|editor2=Raj Sharman \|editor3=T. S. Raghu \|location=Berlin\|page=232\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://books.google.com/books?id=t7RDjagG1FAC&pg=PA498 \|language=en}}</ref>

	==Algorithms==		==Algorithms==

Citation bot: Removed parameters. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_toolbar

2021-11-15T04:42:10Z

Removed parameters. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_toolbar

← Previous revision		Revision as of 04:42, 15 November 2021
Line 1:		Line 1:
	A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. Most phonetic algorithms were developed for [[English language\|English]] and are not useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://www.google.com/books/edition/Exploring_the_Grand_Challenges_for_Next/cZvDnVVmI98C?hl=en&gbpv=1&pg=PA232&printsec=frontcover\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483 \|editor=H. Raghav Rao \|editor2=Raj Sharman \|editor3=T. S. Raghu \|location=Berlin\|page=232~~\|pages=~~\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://www.google.com/books/edition/Growing_Information_Part_2/t7RDjagG1FAC?hl=en&pg=PA498&printsec=frontcover \|language=en}}</ref>		A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. Most phonetic algorithms were developed for [[English language\|English]] and are not useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://www.google.com/books/edition/Exploring_the_Grand_Challenges_for_Next/cZvDnVVmI98C?hl=en&gbpv=1&pg=PA232&printsec=frontcover\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483 \|editor=H. Raghav Rao \|editor2=Raj Sharman \|editor3=T. S. Raghu \|location=Berlin\|page=232\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://www.google.com/books/edition/Growing_Information_Part_2/t7RDjagG1FAC?hl=en&pg=PA498&printsec=frontcover \|language=en}}</ref>

	==Algorithms==		==Algorithms==

Trappist the monk: /* top */ cite repair;

2020-12-31T14:05:42Z

top: cite repair;

← Previous revision		Revision as of 14:05, 31 December 2020
Line 1:		Line 1:
	A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. Most phonetic algorithms were developed for [[English language\|English]] and are not useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://www.google.com/books/edition/Exploring_the_Grand_Challenges_for_Next/cZvDnVVmI98C?hl=en&gbpv=1&pg=PA232&printsec=frontcover\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483\|~~editor1-last~~=H. Raghav Rao, Raj Sharman, T. S. Raghu\|location=Berlin\|page=232\|pages=\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://www.google.com/books/edition/Growing_Information_Part_2/t7RDjagG1FAC?hl=en&pg=PA498&printsec=frontcover \|language=en}}</ref>		A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. Most phonetic algorithms were developed for [[English language\|English]] and are not useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://www.google.com/books/edition/Exploring_the_Grand_Challenges_for_Next/cZvDnVVmI98C?hl=en&gbpv=1&pg=PA232&printsec=frontcover\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483 \|editor=H. Raghav Rao \|editor2=Raj Sharman \|editor3=T. S. Raghu \|location=Berlin\|page=232\|pages=\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://www.google.com/books/edition/Growing_Information_Part_2/t7RDjagG1FAC?hl=en&pg=PA498&printsec=frontcover \|language=en}}</ref>

	==Algorithms==		==Algorithms==
	Among the best-known phonetic algorithms are:		Among the best-known phonetic algorithms are:

Rodw: Disambiguating links to English (link changed to English language) using DisamAssist.

2020-12-31T11:13:03Z

Disambiguating links to English (link changed to English language) using DisamAssist.

← Previous revision		Revision as of 11:13, 31 December 2020
Line 1:		Line 1:
	A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. Most phonetic algorithms were developed for [[English]] and are not useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://www.google.com/books/edition/Exploring_the_Grand_Challenges_for_Next/cZvDnVVmI98C?hl=en&gbpv=1&pg=PA232&printsec=frontcover\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483\|editor1-last=H. Raghav Rao, Raj Sharman, T. S. Raghu\|location=Berlin\|page=232\|pages=\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://www.google.com/books/edition/Growing_Information_Part_2/t7RDjagG1FAC?hl=en&pg=PA498&printsec=frontcover \|language=en}}</ref>		A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. Most phonetic algorithms were developed for [[English language\|English]] and are not useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://www.google.com/books/edition/Exploring_the_Grand_Challenges_for_Next/cZvDnVVmI98C?hl=en&gbpv=1&pg=PA232&printsec=frontcover\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483\|editor1-last=H. Raghav Rao, Raj Sharman, T. S. Raghu\|location=Berlin\|page=232\|pages=\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://www.google.com/books/edition/Growing_Information_Part_2/t7RDjagG1FAC?hl=en&pg=PA498&printsec=frontcover \|language=en}}</ref>
	==Algorithms==		==Algorithms==
	Among the best-known phonetic algorithms are:		Among the best-known phonetic algorithms are:

Orgullomoore: removed {{Refimprove|date=August 2009}} - added refs

2020-12-31T02:28:20Z

removed {{Refimprove|date=August 2009}} - added refs

← Previous revision		Revision as of 02:28, 31 December 2020
Line 1:		Line 1:
	{{Refimprove\|date=August 2009}}

	A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. Most phonetic algorithms were developed for [[English]] and are not useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://www.google.com/books/edition/Exploring_the_Grand_Challenges_for_Next/cZvDnVVmI98C?hl=en&gbpv=1&pg=PA232&printsec=frontcover\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483\|editor1-last=H. Raghav Rao, Raj Sharman, T. S. Raghu\|location=Berlin\|page=232\|pages=\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://www.google.com/books/edition/Growing_Information_Part_2/t7RDjagG1FAC?hl=en&pg=PA498&printsec=frontcover \|language=en}}</ref>		A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. Most phonetic algorithms were developed for [[English]] and are not useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://www.google.com/books/edition/Exploring_the_Grand_Challenges_for_Next/cZvDnVVmI98C?hl=en&gbpv=1&pg=PA232&printsec=frontcover\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483\|editor1-last=H. Raghav Rao, Raj Sharman, T. S. Raghu\|location=Berlin\|page=232\|pages=\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://www.google.com/books/edition/Growing_Information_Part_2/t7RDjagG1FAC?hl=en&pg=PA498&printsec=frontcover \|language=en}}</ref>
	==Algorithms==		==Algorithms==

Orgullomoore: added cite for Because English spelling 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.{{cite book |last1=Cohen |first1=Eli B. |title=Growing Information: Part 2 |date=2009 |publisher=Informing Science |location=Santa Rosa, Calif. |isbn=978-1-932886-17-7 |page=498 |url=https://www.google.com/books/edit

2020-12-31T02:27:21Z

added cite for Because English spelling 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.<ref>{{cite book |last1=Cohen |first1=Eli B. |title=Growing Information: Part 2 |date=2009 |publisher=Informing Science |location=Santa Rosa, Calif. |isbn=978-1-932886-17-7 |page=498 |url=https://www.google.com/books/edit

← Previous revision		Revision as of 02:27, 31 December 2020
Line 1:		Line 1:
	{{Refimprove\|date=August 2009}}		{{Refimprove\|date=August 2009}}

	A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. Most phonetic algorithms were developed for [[English]] and are not useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://www.google.com/books/edition/Exploring_the_Grand_Challenges_for_Next/cZvDnVVmI98C?hl=en&gbpv=1&pg=PA232&printsec=frontcover\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483\|editor1-last=H. Raghav Rao, Raj Sharman, T. S. Raghu\|location=Berlin\|page=232\|pages=\|access-date=31 December 2020}}</ref>		A '''phonetic algorithm''' is an [[algorithm]] for [[index (publishing)\|indexing]] of [[word]]s by their [[pronunciation]]. Most phonetic algorithms were developed for [[English]] and are not useful for indexing words in other languages.<ref>{{cite book\|last1=Li\|first=Nan\|url=https://www.google.com/books/edition/Exploring_the_Grand_Challenges_for_Next/cZvDnVVmI98C?hl=en&gbpv=1&pg=PA232&printsec=frontcover\|title=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\|last2=Hitchcock\|first2=Peter\|last3=Blustein\|first3=James\|last4=Bliemel\|first4=Michael\|date=2011\|publisher=Springer\|isbn=9783642174483\|editor1-last=H. Raghav Rao, Raj Sharman, T. S. Raghu\|location=Berlin\|page=232\|pages=\|access-date=31 December 2020}}</ref> Because [[English orthography\|English spelling]] 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.<ref>{{cite book \|last1=Cohen \|first1=Eli B. \|title=Growing Information: Part 2 \|date=2009 \|publisher=Informing Science \|location=Santa Rosa, Calif. \|isbn=978-1-932886-17-7 \|page=498 \|url=https://www.google.com/books/edition/Growing_Information_Part_2/t7RDjagG1FAC?hl=en&pg=PA498&printsec=frontcover \|language=en}}</ref>

	They are necessarily{{fact\|date=September 2017}} complex algorithms with many rules and exceptions, because English [[spelling]] and pronunciation is complicated by historical changes in pronunciation and words [[loanword\|borrowed]] from many [[language]]s.

	==Algorithms==		==Algorithms==
	Among the best-known phonetic algorithms are:		Among the best-known phonetic algorithms are: