answersLogoWhite

0

For the possessive: In English all singular possessives are formed by adding -'s, regardless of spelling. Jane's husband was in Russ's house.

Plurals already ending in -s add the apostrophe only: The Apostles' Creed.

Plurals not ending is -s add -'s: Children's, women's etc

In contractions, -'s may stand informally for is or has. It's mine; He's done it.

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

What is the rule for naming?

Grammar.


What is a grammar rule?

A grammar rule is when you have a rule of grammar which makes your English correct for example; Emma said "Turn on the light please" (correct) Emma said Turn on the light please (wrong) because you have not used speech marks which is breaking a grammar rule because the grammar rule you are breaking is to always use speech marks when someone is talking!


What is an exception to a rule in English grammar?

An anomaly


When running a grammar check on your Word document what button in the spelling and grammar dialog box will display information about the grammar rule?

Explain


What is a term for grammar?

The rule-system (of the language).


What is a word for rules of language?

The rule of language is grammar.


Why do you need to learn grammar?

Grammar is very important. Grammar is very useful. If one uses proper grammar, then their messages are clear and everyone can understand what they are talking about.


Another term for grammar is?

rule-system (of a language)


What is another word for rules of language?

Another word for rule of language is Grammar.


What is an exception to a rule in English grammar or spelling?

The word "weird" is an exception to the rule "i before e except after c".


What is the term for when an author purposely uses bad grammar?

The term for when an author deliberately uses bad grammar for artistic effect is called "inventive syntax" or "non-standard grammar." This technique can be used to create a specific tone or voice in the writing, or to challenge traditional grammar rules for creative purposes.


How can one convert a right linear grammar to a nondeterministic finite automaton (NFA)?

To convert a right linear grammar to a nondeterministic finite automaton (NFA), you can create states in the NFA corresponding to the variables and terminals in the grammar. Then, for each production rule in the grammar, you can create transitions in the NFA based on the right-hand side of the rule. This process allows you to represent the grammar as an NFA that can recognize the same language.