Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Uncovering Probabilistic Implications in Typological Knowledge Bases (1906.07389v1)

Published 18 Jun 2019 in cs.CL, cs.AI, and stat.ML

Abstract: The study of linguistic typology is rooted in the implications we find between linguistic features, such as the fact that languages with object-verb word ordering tend to have post-positions. Uncovering such implications typically amounts to time-consuming manual processing by trained and experienced linguists, which potentially leaves key linguistic universals unexplored. In this paper, we present a computational model which successfully identifies known universals, including Greenberg universals, but also uncovers new ones, worthy of further linguistic investigation. Our approach outperforms baselines previously used for this problem, as well as a strong baseline from knowledge base population.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Johannes Bjerva (52 papers)
  2. Yova Kementchedjhieva (29 papers)
  3. Ryan Cotterell (226 papers)
  4. Isabelle Augenstein (131 papers)
Citations (11)

Summary

We haven't generated a summary for this paper yet.