Abstract
Straightforward application of the ‘same birthdays’ problem shows that it is surprisingly easy to find a match for any CVC‐root when wordlists of many languages are compared simultaneously. A simple algorithm can be used to estimate the expected incidence of multiple CVC‐matches. A test of a sample from Greenberg's ‘Amerind Etymological Dictionary’ using that algorithm finds no ‘cognate sets’ whose resemblances are clearly not the result of random factors. The same test can and should be applied to all comparative etymological dictionaries.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
