यह एक ऑडियो पोस्ट है, नीचे दिए गए प्लेयर को प्ले कीजिये इसमें मैंने प्रोग्रामिंग कैसे सीखें बिषय पर अपने विचारों को व्यक्त किया है- उम्मीद है कि विद्यार्थियों को इससे लाभ होगा, यदि आपका कोई सवाल है तो आप यहाँ लिख सकते हैं, मैं कोशिश करूँगा आपकी समस्याओं का समाधान करने का|
एक प्रयास है सूचना प्रौद्योगिकी से जुडी तमाम जानकारियां आप तक सरलतम शब्दों में पहुँचाने का, उम्मीद है आपको पसंद आएगा|
C लेबलों वाले संदेश दिखाए जा रहे हैं. सभी संदेश दिखाएं
C लेबलों वाले संदेश दिखाए जा रहे हैं. सभी संदेश दिखाएं
12 फ़रवरी 2011
ऑडियो पोस्ट: प्रोग्रामिंग कैसे सीखें?
14 जुलाई 2010
19 दिसंबर 2007
The Phonetic Algorithm
hi! friends
i am going to introduce u with an algorithm which will automatically detect phonetic spelling mistakes in to your documents.
Problem : To provide accurate spellings on phonetically mispelled words.
Soundex is a phonetic algorithm.
SOUNDEX()
1. Retain the first letter of the string.
2. Remove all occurrences of the following letters unless it is the first letter:
a, e, h, i, o, u, w, y
3. assign numbers to the remaning letters (after the first) as follows:
* b, f, p, v = 1
* c, g, j, k, q, s, x, z =2
* d, t = 3
* l = 4
* m, n =5
* r = 6
4. if two or more letters with the same number were adjacen in the original name ( before step 1), or adjacent except for any intervening h and w (American census only), then omit all but the first.
5. Return the first four characters, right-padding with zeros if there are fewer than four.
Guys try to implement it. if any problem or qustion mail me........
i am going to introduce u with an algorithm which will automatically detect phonetic spelling mistakes in to your documents.
Problem : To provide accurate spellings on phonetically mispelled words.
Soundex is a phonetic algorithm.
SOUNDEX()
1. Retain the first letter of the string.
2. Remove all occurrences of the following letters unless it is the first letter:
a, e, h, i, o, u, w, y
3. assign numbers to the remaning letters (after the first) as follows:
* b, f, p, v = 1
* c, g, j, k, q, s, x, z =2
* d, t = 3
* l = 4
* m, n =5
* r = 6
4. if two or more letters with the same number were adjacen in the original name ( before step 1), or adjacent except for any intervening h and w (American census only), then omit all but the first.
5. Return the first four characters, right-padding with zeros if there are fewer than four.
Guys try to implement it. if any problem or qustion mail me........
सदस्यता लें
संदेश (Atom)