Top Posters
Since Sunday
y
2
m
2
m
2
u
2
m
2
B
2
M
2
e
2
k
2
N
2
y
2
m
2
New Topic  
prashantakerkar prashantakerkar
wrote...
Valued Member
Posts: 1649
4 years ago Edited: 4 years ago, prashantakerkar
https://www.google.com/search?sxsrf=ALeKk01_SgA8G4UfNm4rOqku4yJBFvKhLw%3A1600154854621&source=hp&ei=5mxgX8ztI6KZ4-EPq-mL8Ak&q=homophones+example&oq=Homophones&gs_lcp=ChFtb2JpbGUtZ3dzLXdpei1ocBABGAEyBQgAELEDMgUIABCxAzICCAAyCAgAELEDEIMBMgUIABCxAzICCAAyAggAMgUIABCxAzoHCCMQ6gIQJzoECCMQJzoFCAAQkQI6CAguELEDEIMBOgUILhCxA1DkKliKSGDuUGgBcAB4AIAB6wGIAe8NkgEFMC44LjKYAQCgAQGwAQ8&sclient=mobile-gws-wiz-hp

https://en.wikipedia.org/wiki/Machine_learning

Are there Machine learning algorithms for forming Homophones from input dataset word?

Homophones examples :

accessary, accessory.
ad, add.
air, heir.
all, awl.
allowed, aloud.
alms, arms.

Thanks & Regards,
Prashant S Akerkar
Read 145 times
3 Replies
Prashant S Akerkar
Replies
wrote...
Educator
4 years ago Edited: 4 years ago, bio_man
I don't understand this question. Why would you need a machine to determine if two or more words are homophones when in any language the total number of words are finite. All you need need is a database of all known homophones that exist.
wrote...
Valued Member
4 years ago
Thanks.

Can Machine learning algorithms detect Homophones given a english word?

Thanks & Regards,
Prashant S Akerkar

Prashant S Akerkar
Answer accepted by topic starter
bio_manbio_man
wrote...
Educator
Top Poster
Posts: 33333
4 years ago
Sign in or Sign up in seconds to unlock everything for free
1

Related Topics

New Topic      
Explore
Post your homework questions and get free online help from our incredible volunteers
  527 People Browsing
Related Images
  
 340
  
 230
  
 3471
Your Opinion
Where do you get your textbooks?
Votes: 447