Words created by a word repeating

Definition

Word Formation Process (also called Morphological Process) is a means by which new words are produced either by modification of existing words or by complete innovation, which in turn become a part of the language.

Types of Word Formation Processes

Different types of word formation processes are employed to create new words. However, all word formation processes basically bring either inflectional or derivational changes. Therefore, inflection (also called inflexion) and derivation are the two core processes of word formation. Inflection differs from derivation to the following extent:

The major word formation processes include but are not limited to the following:

Affixation

It is a word formation process wherein an affix is attached to a root (also called stem; base) to form a new word. A root is a free morpheme (also called unbound morpheme) that can appear alone. On the other hand, an Affix is a bound morpheme which never occurs by itself, but is always attached to some free morpheme and can be either inflectional or derivational. An Inflectional affix modifies the form/grammatical category of a word, i.e., tense, person, number, gender, case, etc. For example: rat → rats. Contrariwise, a derivational affix modifies the parts of speech of the root, while leaving the grammatical category unchanged. In this way, there is a change of meaning of the root. For example: write → writer.

In English there are two types of affixations:

1. Prefixation: In this morphological process words are formed by adding an affix to the front of a root. The type of affix used in this process is referred to as prefix. For example: un + tidy → untidy
2. Suffixation: In this morphological process words are formed by adding an affix to the end of a root. The type of affix used in this process is referred to as suffix. For example: fear + less → fearless

Conversion

This refers to the change of function or parts of speech of a word without adding an affix. Conversion is also called zero derivation or null derivation since the functional change is brought about by supplementing an invisible affix. Sometimes it is also called functional shift. Typically conversion is made from “noun to verb” and from “verb to noun”. Less frequently, conversion is also done from “adjective to verb” and “adjective to noun”. For instance:

 Noun to Verb:  

• access
• email
• film
• name
• shape

Verb to Noun:

• attack
• alert
• hope
• increase
• visit
• cover

Adjective to Verb:

• brown
• black
• slow

Adjective to Noun:

• crazy
• nasty

Back-formation

Back-formation is a morphological process in which new word is created by extracting affixes from another word. In this way, it is the reverse of affixation, in which affixes are added. Back-formation is also different from clipping since it brings a change in the parts of speech or the word’s meaning. For example: the noun insertion has been back-formed into verb insert by removing the suffix ion.

Clipping

As the name suggests, clipping is the word formation process in which a word is reduced to a shorter form. With a sharp contrast to back-formation, clipping keeps the original word meaning intact. These words are very common in everyday speech. For instance: lab is the clipped form of laboratory. . There are four types of clippings:

1. Back clipping: (also called final clipping; apocope) it involves the truncation of end of a word as in ad from advertisement.
2. Fore-clipping: (also called initial clipping; apheresis) it is the removal of the beginning of a word as in phone from telephone.
3. Middle clipping: (also medial clipping; syncope) it is the extraction of the beginning and end of a word as in flu from influenza.
4. Complex clipping: is removing multiple parts from multiple words as in cablegram from cabletelegram.

Compounding

Also called composition, by this process two or more than two words are combined together to create a single word, having a single idea and function. In English, there are compound nouns, compound adjectives, and compound verbs. Customarily compound words are spelt as a single word, or as two or more hyphenated words, and even as two or more separate words. For example:

• life + style → lifestyle
• mother + in + law → mother-in-law
• shopping + mall → shopping mall

There are no specific rules for hyphenated compounds. Generally, some new and original compound nouns are hyphenated, but the hyphen is ignored when they become more familiar. However, there are some compound adjectives that are always hyphenated. For instance: state-of-the-art. The hyphen is often retained when two vowels come together, such as: Co-operation. Hyphens are often used to tell the ages of people and things, for example: 10-year-old. The general rule is that words are combined with hyphens to avoid confusion.

Borrowing

This refers to the words adopted from other languages. There are two types of borrowings:

1. Loan-word: By this process, a word is borrowed from another language without translating it into the target language. For example: the phrase tour-de-force is borrowed directly from French, which means a masterly or brilliant feat.
2. Loan-translation: Also known as calque, a morphological process wherein a word or phrase from another language is borrowed by literally translating it into the target language. For example: the phrase point of view has been translated into English from the French phrase point de vue.

Coinage

Also called invention, is a morphological process by which new words are invented. Sometimes popular trademark names of various products are adopted by people so extensively that they ultimately become the everyday words of language. For example:

• Heroin
• Aspirin
• Escalator
• Xerox
• Kerosene
• Nylon
• Band-Aid
• Vaseline
• Margarine
• Videotape

Again, some words are being invented due to rapid cultural changes and the spread of information technology, mass media, internet, etc. For example:

• Google
• Blog
• Hotspot
• Netbook
• Tablet
• Tweet
• Emoticon
• Smartphone

Blending

Blending (also called portmanteau) is a morphological process in which the parts of two or more words are combined together to form a new word. Usually, the parts consist of the beginning of one word and the end of the other word(s). Typically, the meaning of the blended word reverberates with the meanings of the original words. For example:

• breakfast + lunch → brunch
• motor+hotel → motel

However, blending should not be confused with compounding, which combines two words without truncation of parts of the roots of the blended words.

Acronyms

These words are formed with the initial letters or each of the major parts of a word or a longer phrase. With a few exceptions, acronyms are usually capitalized. Some linguists confuse acronyms with initialisms, which are also abbreviations formed in the similar manner as the former. In essence, there is a sharp difference between the two. In language, an acronym is pronounced as a single word rather than just a sequence of individual letters, which is characteristic of initialisms. For example:
Acronyms:

• United Nations Educational, Scientific and Cultural Organization → UNESCO
• Light Amplification by Stimulated Emission of Radiation → Laser
• International Criminal Police Organization → Interpol

Initialisms:

• Personal Computer → PC
• Asian Development Bank → ADB
• Liquid Crystal Display → LCD

Reduplication

Reduplication (also called cloning; doubling; duplication; repetition; tautonym) is a word formation process in which a new word is created by repeating all or part of a root or a stem, often with a change of vowel or initial consonant. Reduplication is not a major means of creating lexemes in English, but it is perhaps the most unusual one. Based on their usage, the techniques of reduplication could be classified in the following manner:

1. Repetition without Change: bye-bye, tick-tick
2. Rhyming Reduplication: ding-dong, super-duper, bow-wow
3. Repetition with Change of Vowel: tiptop, chitchat, flip-flop, ping-pong, dilly-dally, wishy-washy
4. Repetition with Change of Initial Consonant: teeny-weeny

References

“English Word Formation Processes.” Really Learn English. 2016. Really-Learn-English.com.

14 July 2016 <http://www.really-learn-english.com/word-formation-processes.html>.

 “Inflection.” Wikipedia. 2016. Wikimedia Foundation Inc. 14 July 2016

<http://en.wikipedia.org/wiki/Inflection>.

“Morphological Derivation.” Wikipedia. 2016. Wikimedia Foundation Inc. 14 July 2016

<http://en.wikipedia.org/wiki/Morphological_derivation>.

Yule, George. The Study of Language. 2^nd ed. Cambridge: CUP, 1996.

“Word Formation.” Wikipedia. 2016. Wikimedia Foundation Inc. 14 July 2016

<https://en.wikipedia.org/wiki/Word_formation>.

When writing, even the most expert makes mistakes. Both in writing and in style. On many occasions the same program corrects them, but sometimes you have to help it, as is the case of finding all the repeated words in a Word document .

When you review your document, no matter how many times you read it, you may not notice all the errors that are in it. Similarly, the automatic corrector is not always as effective as it is thought. Don’t worry, Word has the necessary tools to correct your text and leave it without a single error. You just have to learn how to use it to get the most out of it.

How to Find All Repeated Words in a Word Document

It is necessary to know how many versions of Windows 10 there are, to determine if you have the most recent and therefore the most current edition of Word.

Index(  )

1. What is called the repetition of words in a text
2. Find all repeated words in a Word document
   1. Word wildcards
3. How to easily check repeated words in Word
   1. Find repeating paragraphs in Word
4. Repeated words in a Word document and wildcards
5. How to underline all the same words in Word
   1. How to delete the same words in Word
6. How to find all the repeated words in a Word document using wildcards?

What is called the repetition of words in a text

There is no specific term for this problem, but we could use ‘redundancy’ or ‘catchphrase’. Redundancy refers to the tendency to extend an argument too long and is something that should be avoided in certain cases. On the other hand, the catchphrase is the use of phrases in a repetitive way.

Although the catchphrase is seen mainly in speeches, it can also sneak into our texts, if we tend to use a word too much. Redundancy serves a purpose if you want to express a complex message in an explainable way, but you have to be careful and the catchphrase should also be avoided at all costs .

One of the most common mistakes when writing a document is that sometimes repeated words can be written. Normally, Word’s auto-checker alerts you to this error by underlining repetition in red. But this is not infallible, if you have the correction tool disabled it is still possible to detect these errors very easily. Using the program’s wildcards.

Word wildcards

Wildcards in Word are quite useful tools when navigating and correcting a document. However, many users do not know how to use them and many more do not even know that they exist. To find all the repeated words in a Word document, you can make use of these wildcards and even lock the position of an image in Word.

How to easily check repeated words in Word

Without a doubt, the easiest way to find repeated words in a Word document is by using the underline tool. With this tool you can check the integrity of your text looking for words that you think you repeated a lot. We will show you this below.

Find repeating paragraphs in Word

You may have gotten confused and copied a paragraph into large text. Fortunately, you can find repeating paragraphs if you use the underline tool below. It is enough that, instead of writing a word, you paste the text that is repeated in the document .

Repeated words in a Word document and wildcards

To get a repeated word, the first thing to do is search for a word, right? For this we will use the Word tool ” Search “. This is in the ” Start ” section of the top menu. It should be noted that to use this type of search you must select the “Use wildcard characters” box in the Search and Replace window.

If a word is a sequence of letters arranged in a specific way. So the first wildcard to use would be [a-zA-Z]. In this way the search engine will consider all the letters of the alphabet taking into account upper and lower case. Similarly, within this sequence will be the vowels with their accents and the letter “ñ”.

With that joker you can already get a letter. Now, how to find a word? Well, to do that you must use this wildcard [aaZ] {1;}. This is translated as a redundant letter one or more times, counting capital letters, accents, and the letter ñ.

The <> characters placed at the beginning and end of the wildcard will indicate the beginning and end of each word. But since you want to search for repeated words, you will modify the wildcard to the following <[a-zA-Z] {1;}). By replacing the “greater than” characters with a parenthesis, you are saying that you want to search for words followed by a space.

How to underline all the same words in Word

Underlining words is simple, for this we must use the ‘Find and replace’ tool. This option is found in the ‘Home’ section with the name of ‘Replace’, in turn, you can press Ctrl + B to display the tool.

Make sure you are in the ‘Search’ tab and type the word you want to search for. At the top you will see the option ‘Highlight reading’ , There select ‘Highlight all’. Doing the above will highlight the word in the text so you can see all the times it is there.

How to delete the same words in Word

To eliminate the repeated words, we must also use the ‘Find and replace’ tool . Remember, you access it through ‘Start’, there click on ‘Replace’. The tool menu will be displayed, you must click on the ‘Replace’ tab.

In ‘Search’ write the term you want to remove from your text and leave the ‘Replace with’ section blank. You can do the process one by one, clicking on ‘Find next’ to see the word in each section of the text, to make the modification click on ‘Replace’. If you want to remove all the words , click on ‘Replace all’.

How to find all the repeated words in a Word document using wildcards?

As an extra point, you should know that wildcards also apply to other cases, such as inserting a YouTube video in a Word document , a useful tool to finalize the file together with the elimination of repeated words.

Now, if the previous wildcard only searches for words followed by a space , how to find all the repeated words in a Word document? For that case, the wildcard explained above would be modified to the following (<[a-zA-Z] {1;}) 1>.

If you can tell, the previous wildcard is now inside parentheses. In wildcard theory it says that parentheses are used to create search references. Therefore adding parentheses created a reference.

This is followed by a space and then 1 follows. This refers to the word to search for. That is, to the first group of parentheses. If there were more sets of characters the reference would be  2, 3, or the amount of group of parentheses that are.

And finally this character> refers to the end of the word. So if you use this wildcard, it will find the redundancy “his his” but not “his dream” . Finally, after finding all the repeated words in a Word document, you will want to delete all the repeated words.

Thus, in the Word search and replace window you must put the following wildcard in the search bar (<[a-zA-Z] {1;}) 1> and in the replace window you must put 1. In this way, the repeated word will be deleted automatically.

Given a string, Find the 1st repeated word in a string

Examples: 

Input : "Ravi had been saying that he had been there"
Output : had

Input : "Ravi had been saying that"
Output : No Repetition

Input : "he had had he"
Output : he

question source : https://www.geeksforgeeks.org/goldman-sachs-interview-experience-set-29-internship/

Simple Approach : Start iterating from back and for every new word , store it in unordered map . For every word which has occurred more than one  , update ans to be that word , at last reverse ans and print it.

Implementation:

had
No Repetition
he

Another Approach: The idea is to tokenize the string and store each word and its count in hashmap. Then traverse the string again and for each word of string, check its count in created hashmap. 

Implementation:

First repeated word :: had

Method #2: Using built in python functions:

• As all the words in a sentence are separated by spaces.
• We have to split the sentence by spaces using split().
• We split all the words by spaces and store them in a list.
• Use Counter function to count frequency of words
• Traverse the list and check if any word has frequency greater than 1
• If it is present then print the word and break the loop

Implementation::

Another Approach: 

Instead of tracking the counts for a specific token(word), we can keep track of the first occurrence of the token(word) using an unordered map. This would not require any extra loop to traverse in a hashmap or a string to find the repeated string. Thus, it eventually transforms the time complexity from O(2*n) to O(n) while the space complexity remains the same.

Implementation:

had
No Repetition
he

Optimized Approach:

Instead of counting a number of occurrences of each word which will have O(N) time and space complexity, where N is number of words, we can stop when the count of any word becomes 2. That is no need to iterate through all the words in string.

Let’s say our first repeated word is present at Mth index, then

By using this approach, space and time complexity reduced from O(N) to O(M).

Where,

N: number of words in a string.

M: Index at which first repeating word is present

However, Worst case( When no word is being repeated or the word being repeated is present at last) time and space complexity will still be O(N).

Steps:

• Create a default dictionary with an initial value of 0, to keep track count of words.
• Iterate through each word in a sentence and increment the count of that word by 1.
• If (count of the word) > 1, return the word.
• If the count of none of the words is greater than 1 then that is we are outside our loop then return “No word is being repeated”.

Implementation:

Time complexity: O(M)
Space Complexity: O(M)

Optimized Approach 2:

Instead of counting a number of occurrences of each word which will have O(N) time and space complexity, where N is a number of words, we can just store words in a HashSet, and as soon as we reach a word that is already present in the HashSet we can return.

Implementation:

First repeated word :: had

This article is contributed by Aarti_Rathi and Mandeep Singh. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.