Questions tagged [complex-sentences]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
1
vote
3answers
189 views

How to 'correctly' measure the complexity of the grammar of a language?

Linguists have some methods to measure the complexities of the grammar of a language. Some linguists may refer to how many grammar rules that language has. some may also refer to how many morphemes ...
2
votes
2answers
59 views

Languages w/out dependent clauses

Is there a language w/out dependent clauses, i.e. one in which you couldn't say e.g. "I know that x is here" w/ a clause, where the main clause is in italic and dependent in bold (and that overlaps, ...
0
votes
1answer
85 views

Subordination. Chinese vs English

Linguists claim that subordination is universal across the world languages. Subordination in English looks can be understood by looking into these examples: I know a person who has a dog I know a ...
0
votes
1answer
46 views

Formal semantics (Montague, type-theoretical) of adverbial clauses

Partee has nice summary about the formal semantics of relative clause http://people.umass.edu/partee/MGU_2005/MGU05Lec10.pdf (subordinate adjectival clause). E.g. At least one boy who Mary loves is ...
0
votes
1answer
44 views

Is it possible that whole relative clause refers/describes one word/phrase in the main clause (without anaphora)?

My running example is the sentence (from the VAT law of one country): The building land is the plot in relation to which the building permit has been issued. There are possible at least two views on ...
0
votes
1answer
44 views

Formal semantics of subordinate clauses (compound sentences) - in categorial and type logical grammars?

I am trying to apply combinatory categorial grammars and type logical grammars (Montague semantics etc.) to the compound sentences and the subordinate clauses. Are there efforts to develop those ...
19
votes
4answers
3k views

Is there a linguistics equivalent to Turing completeness?

In computer science, programming languages can be described in terms of "Turing completeness", basically, whether a programming language is capable of expressing any* algorithm. A non-Turing-complete ...
1
vote
0answers
35 views

Detecting Sentence Boundry

Lets say someone writes a message like: Bob: You are my best friend Daniel Nelsion: You have helped me a lot How can this type of written messages be separated as : Bob: You are my best friend ...
3
votes
2answers
105 views

Are there languages with discontinued subordinate clauses?

As for the languages I know I think to believe, that a subordinated clause comes in a chunk and not scattered throughout the main clause. For instance: I LIKE TO SING, while i slave away while I ...
1
vote
3answers
169 views

Help with constituency?

I am learning syntactic theory from the book "English Syntax and Argumentation." I got decent understanding of S, NP, VP, I. I do not use DP or TP because the textbook does not use it. However, I have ...
2
votes
0answers
972 views

Split a sentence using nltk and python

I am working on a task which involves information extraction, for which I require splitting a complex sentence into a bunch of simple sentences. For instance, In optics a ray is an idealized model ...
1
vote
1answer
320 views

Complex Sentence

I am having difficulty figuring out how to draw a syntax tree for the sentence: "Bill reported that a student asked whether the eclipse would occur." Im confused on which word is the complementiser ...
3
votes
2answers
467 views

How to find a given text's complexity?

I'm working on an application to teach English to people. In this application I need to classify texts based on many factors: What is the current knowledge the learner What is his/her interests How ...