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
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quantifying syntax similarity with a polynomial representation of dependency trees (2211.07005v1)

Published 13 Nov 2022 in cs.CL and math.CO

Abstract: We introduce a graph polynomial that distinguishes tree structures to represent dependency grammar and a measure based on the polynomial representation to quantify syntax similarity. The polynomial encodes accurate and comprehensive information about the dependency structure and dependency relations of words in a sentence. We apply the polynomial-based methods to analyze sentences in the Parallel Universal Dependencies treebanks. Specifically, we compare the syntax of sentences and their translations in different languages, and we perform a syntactic typology study of available languages in the Parallel Universal Dependencies treebanks. We also demonstrate and discuss the potential of the methods in measuring syntax diversity of corpora.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Pengyu Liu (46 papers)
  2. Tinghao Feng (2 papers)
  3. Rui Liu (321 papers)
Citations (5)

Summary

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