[{“box”:0,”content”:”[if 992 equals=”Open Access”]n
n
Open Access
nn
n
n[/if 992]n
n
n
n
n
n
Vishal Paul Jeosuva, Rajesh Yadav
n
- n t
n
n
n[/foreach]
n
n[if 2099 not_equal=”Yes”]n
- [foreach 286] [if 1175 not_equal=””]n t
- Student, Assistant Professor Department of Computer Science, SIES College of Arts, Science & Commerce ( Empowered Autonomous), Mumbai, Department of Computer Science, SIES College of Arts, Science & Commerce ( Empowered Autonomous), Mumbai Maharashtra, Maharashtra India, India
n[/if 1175][/foreach]
n[/if 2099][if 2099 equals=”Yes”][/if 2099]n
Abstract
nAs a human we always makes mistakes while pronouncing the words, names , terms which sound alike. As a result of which those spellings are difficult to identify. In order to simplify this problem, we have discussed about an algorithm called Soundex Algorithm which provides a solution to pronunciation problem by giving a similar code with 1 letter and 3 digit code as syntactical solution to all term that sound alike. In our paper , we have discussed following section to give a brief overview- Introduction, History , Literature Review Algorithmic rules , Python based Implementation, Real Life Applications, Key Benefits, Limitations, and Conclusion.
n
Keywords: Soundex, Pronunciation, Similar Spellings, Robert Russell.
n[if 424 equals=”Regular Issue”][This article belongs to International Journal of Algorithms Design and Analysis Review(ijadar)]
n
n
n
n
n
nn[if 992 equals=”Open Access”] Full Text PDF Download[/if 992] n[if 992 not_equal=”Open Access”]
[/if 992]n[if 992 not_equal=”Open Access”] nnn[/if 992]nn[if 379 not_equal=””]n
Browse Figures
n
n[/if 379]n
References
n[if 1104 equals=””]n
- Zobel J, Dart P. Phonetic string matching: Lessons from information retrieval. InProceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval 1996 Aug 18 (pp. 166-172).
- Knuth DE. The art of computer programming. Pearson Education; 1997.
- Holmes D, McCabe MC. Improving precision and recall for soundex retrieval. InProceedings. International Conference on Information Technology: Coding and Computing 2002 Apr 8 (pp. 22-26). IEEE.
- Manning CD. An introduction to information retrieval. Cambridge university press; 2009.
- Shah R, Singh DK. Analysis and comparative study on phonetic matching techniques. International Journal of Computer Applications. 2014 Jan 1;87(9).
- Vykhovanets VS, Du J, Sakulin SA. An overview of phonetic encoding algorithms. Automation and Remote Control. 2020 Oct;81:1896-910.
- Wikipedia. Phonetic Algorithm [online]. Available https://en.m.wikipedia.org/wiki/Phonetic_algorithm
- Wikipedia. Soundex Algorithm [online]. https://en.m.wikipedia.org/wiki/Soundex
- Begin My Story. How to Use the Soundex Coding System for Ancestry Census Research [Online]. Available from https://beginmystory.com/soundex-coding-system-ancestry-census-research/
- GenealogyInTime Magazine. Soundex Coding Rules [Online]. Available from http://www.genealogyintime.com/GenealogyResources/Articles/what_is_soundex_and_how_does_soundex_work_page2.html
nn[/if 1104][if 1104 not_equal=””]n
- [foreach 1102]n t
- [if 1106 equals=””], [/if 1106][if 1106 not_equal=””],[/if 1106]
n[/foreach]
n[/if 1104]
nn
nn[if 1114 equals=”Yes”]n
n[/if 1114]
n
n
n
International Journal of Algorithms Design and Analysis Review
n
n
n
n
n
n
| Volume | 02 | |
| [if 424 equals=”Regular Issue”]Issue[/if 424][if 424 equals=”Special Issue”]Special Issue[/if 424] [if 424 equals=”Conference”][/if 424] | 01 | |
| Received | February 15, 2024 | |
| Accepted | March 1, 2024 | |
| Published | May 30, 2024 |
n
n
n
n
n
n function myFunction2() {n var x = document.getElementById(“browsefigure”);n if (x.style.display === “block”) {n x.style.display = “none”;n }n else { x.style.display = “Block”; }n }n document.querySelector(“.prevBtn”).addEventListener(“click”, () => {n changeSlides(-1);n });n document.querySelector(“.nextBtn”).addEventListener(“click”, () => {n changeSlides(1);n });n var slideIndex = 1;n showSlides(slideIndex);n function changeSlides(n) {n showSlides((slideIndex += n));n }n function currentSlide(n) {n showSlides((slideIndex = n));n }n function showSlides(n) {n var i;n var slides = document.getElementsByClassName(“Slide”);n var dots = document.getElementsByClassName(“Navdot”);n if (n > slides.length) { slideIndex = 1; }n if (n (item.style.display = “none”));n Array.from(dots).forEach(n item => (item.className = item.className.replace(” selected”, “”))n );n slides[slideIndex – 1].style.display = “block”;n dots[slideIndex – 1].className += ” selected”;n }n”}]