
如何实现javascript函数来计算给定句子中每个单词的频率.
这是我的代码:
function search () {
var data = document.getElementById('txt').value;
var temp = data;
var words = new Array();
words = temp.split(" ");
var uniqueWords = new Array();
var count = new Array();
for (var i = 0; i < words.length; i++) {
//var count=0;
var f = 0;
for (j = 0; j < uniqueWords.length; j++) {
if (words[i] == uniqueWords[j]) {
count[j] = count[j] + 1;
//uniqueWords[j]=words[i];
f = 1;
}
}
if (f == 0) {
count[i] = 1;
uniqueWords[i] = words[i];
}
console.log("count of " + uniqueWords[i] + " - " + count[i]);
}
}
Run Code Online (Sandbox Code Playgroud)
我无法追查问题..任何帮助都非常有用.以这种格式输出:计数为 - 1计数 - 2 ..
输入:这是anil是kum the anil
Sam*_*son 14
通过使用多个数组,字符串以及在循环和嵌套循环之间频繁(并且难以跟踪)上下文切换,我觉得你有过于复杂的东西.
以下是我鼓励您考虑采取的方法.我已经在评论中概述了解释过程中的每一步.如果其中任何一项不清楚,请在评论中告诉我,我会重新审视以提高清晰度.
(function () {
/* Below is a regular expression that finds alphanumeric characters
Next is a string that could easily be replaced with a reference to a form control
Lastly, we have an array that will hold any words matching our pattern */
var pattern = /\w+/g,
string = "I I am am am yes yes.",
matchedWords = string.match( pattern );
/* The Array.prototype.reduce method assists us in producing a single value from an
array. In this case, we're going to use it to output an object with results. */
var counts = matchedWords.reduce(function ( stats, word ) {
/* `stats` is the object that we'll be building up over time.
`word` is each individual entry in the `matchedWords` array */
if ( stats.hasOwnProperty( word ) ) {
/* `stats` already has an entry for the current `word`.
As a result, let's increment the count for that `word`. */
stats[ word ] = stats[ word ] + 1;
} else {
/* `stats` does not yet have an entry for the current `word`.
As a result, let's add a new entry, and set count to 1. */
stats[ word ] = 1;
}
/* Because we are building up `stats` over numerous iterations,
we need to return it for the next pass to modify it. */
return stats;
}, {} );
/* Now that `counts` has our object, we can log it. */
console.log( counts );
}());
Run Code Online (Sandbox Code Playgroud)
Cym*_*men 14
这是一个JavaScript函数,用于获取句子中每个单词的频率:
function wordFreq(string) {
var words = string.replace(/[.]/g, '').split(/\s/);
var freqMap = {};
words.forEach(function(w) {
if (!freqMap[w]) {
freqMap[w] = 0;
}
freqMap[w] += 1;
});
return freqMap;
}
Run Code Online (Sandbox Code Playgroud)
它将返回单词到字数的哈希值.例如,如果我们像这样运行它:
console.log(wordFreq("I am the big the big bull."));
> Object {I: 1, am: 1, the: 2, big: 2, bull: 1}
Run Code Online (Sandbox Code Playgroud)
你可以迭代单词Object.keys(result).sort().forEach(result) {...}.所以我们可以像这样挂钩:
var freq = wordFreq("I am the big the big bull.");
Object.keys(freq).sort().forEach(function(word) {
console.log("count of " + word + " is " + freq[word]);
});
Run Code Online (Sandbox Code Playgroud)
哪个会输出:
count of I is 1
count of am is 1
count of big is 2
count of bull is 1
count of the is 2
Run Code Online (Sandbox Code Playgroud)
JSFiddle:http://jsfiddle.net/ah6wsbs6/
这是wordFreqES6中的功能:
function wordFreq(string) {
return string.replace(/[.]/g, '')
.split(/\s/)
.reduce((map, word) =>
Object.assign(map, {
[word]: (map[word])
? map[word] + 1
: 1,
}),
{}
);
}
Run Code Online (Sandbox Code Playgroud)
JSFiddle:http://jsfiddle.net/r1Lo79us/