Document distance in JavaScript











up vote
0
down vote

favorite












I am looking for the fastest way to find document distance. How can I improve this?



Split each document into words. replaceAll() is faster than replace()



String.prototype.replaceAll = function(search, replacement) {
return this.replace(new RegExp(search, 'g'), replacement);
};


Creating word array here:



const wordsFromDocument = doc => {
//we care only about alphanumeric characters and space
return doc.replaceAll(/[^a-zA-Z0-9 ]/g, ``).split(` `);
};


count word frequencies (document vectors)



const wordFrequencies = words => {
const wordFrequencyMap = new Map();
for (const word of words) {
const lowerCaseWord = word.toLowerCase(); //We don't care about case sensitivity. What is faster way to achieve this?
if (!wordFrequencyMap.has(lowerCaseWord)) {
wordFrequencyMap.set(lowerCaseWord, 1);
} else {
wordFrequencyMap.set(lowerCaseWord, wordFrequencyMap.get(lowerCaseWord) + 1);
}
}
return wordFrequencyMap;
};


Compute dot product (& divide).



const dotProduct = (wordFrequencyMapOne, wordFrequencyMapTwo) => {
let sum = 0;
const wordOneSize = wordFrequencyMapOne.size;
const wordTwoSize = wordFrequenciesTwo.size;

if (wordOneSize < wordTwoSize) {
for (let key of wordFrequencyMapOne.keys()) {
if (wordFrequencyMapTwo.has(key)) {
sum = sum + wordFrequencyMapOne.get(key) *
wordFrequencyMapTwo.get(key);
}
}
} else {
for (let key of wordFrequenciesTwo.keys()) {
if (wordFrequenciesOne.has(key)) {
sum = sum + wordFrequencyMapOne.get(key) *
wordFrequencyMapTwo.get(key);
}
}
}
return sum;
};


vector angle = (dot(1, 2)) / Sqrt (dot(1, 1) * dot(2, 2))



const vectorAngle = (wordFrequencyMapOne, wordFrequencyMapTwo) => {
const numerator = dotProduct(wordFrequencyMapOne, wordFrequencyMapTwo);
const denominator = Math.sqrt(dotProduct(wordFrequencyMapOne, wordFrequencyMapOne) * (dotProduct(wordFrequenciesTwo, wordFrequenciesTwo)))
return numerator / denominator;
}









share|improve this question









New contributor




user7331530 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
























    up vote
    0
    down vote

    favorite












    I am looking for the fastest way to find document distance. How can I improve this?



    Split each document into words. replaceAll() is faster than replace()



    String.prototype.replaceAll = function(search, replacement) {
    return this.replace(new RegExp(search, 'g'), replacement);
    };


    Creating word array here:



    const wordsFromDocument = doc => {
    //we care only about alphanumeric characters and space
    return doc.replaceAll(/[^a-zA-Z0-9 ]/g, ``).split(` `);
    };


    count word frequencies (document vectors)



    const wordFrequencies = words => {
    const wordFrequencyMap = new Map();
    for (const word of words) {
    const lowerCaseWord = word.toLowerCase(); //We don't care about case sensitivity. What is faster way to achieve this?
    if (!wordFrequencyMap.has(lowerCaseWord)) {
    wordFrequencyMap.set(lowerCaseWord, 1);
    } else {
    wordFrequencyMap.set(lowerCaseWord, wordFrequencyMap.get(lowerCaseWord) + 1);
    }
    }
    return wordFrequencyMap;
    };


    Compute dot product (& divide).



    const dotProduct = (wordFrequencyMapOne, wordFrequencyMapTwo) => {
    let sum = 0;
    const wordOneSize = wordFrequencyMapOne.size;
    const wordTwoSize = wordFrequenciesTwo.size;

    if (wordOneSize < wordTwoSize) {
    for (let key of wordFrequencyMapOne.keys()) {
    if (wordFrequencyMapTwo.has(key)) {
    sum = sum + wordFrequencyMapOne.get(key) *
    wordFrequencyMapTwo.get(key);
    }
    }
    } else {
    for (let key of wordFrequenciesTwo.keys()) {
    if (wordFrequenciesOne.has(key)) {
    sum = sum + wordFrequencyMapOne.get(key) *
    wordFrequencyMapTwo.get(key);
    }
    }
    }
    return sum;
    };


    vector angle = (dot(1, 2)) / Sqrt (dot(1, 1) * dot(2, 2))



    const vectorAngle = (wordFrequencyMapOne, wordFrequencyMapTwo) => {
    const numerator = dotProduct(wordFrequencyMapOne, wordFrequencyMapTwo);
    const denominator = Math.sqrt(dotProduct(wordFrequencyMapOne, wordFrequencyMapOne) * (dotProduct(wordFrequenciesTwo, wordFrequenciesTwo)))
    return numerator / denominator;
    }









    share|improve this question









    New contributor




    user7331530 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.






















      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      I am looking for the fastest way to find document distance. How can I improve this?



      Split each document into words. replaceAll() is faster than replace()



      String.prototype.replaceAll = function(search, replacement) {
      return this.replace(new RegExp(search, 'g'), replacement);
      };


      Creating word array here:



      const wordsFromDocument = doc => {
      //we care only about alphanumeric characters and space
      return doc.replaceAll(/[^a-zA-Z0-9 ]/g, ``).split(` `);
      };


      count word frequencies (document vectors)



      const wordFrequencies = words => {
      const wordFrequencyMap = new Map();
      for (const word of words) {
      const lowerCaseWord = word.toLowerCase(); //We don't care about case sensitivity. What is faster way to achieve this?
      if (!wordFrequencyMap.has(lowerCaseWord)) {
      wordFrequencyMap.set(lowerCaseWord, 1);
      } else {
      wordFrequencyMap.set(lowerCaseWord, wordFrequencyMap.get(lowerCaseWord) + 1);
      }
      }
      return wordFrequencyMap;
      };


      Compute dot product (& divide).



      const dotProduct = (wordFrequencyMapOne, wordFrequencyMapTwo) => {
      let sum = 0;
      const wordOneSize = wordFrequencyMapOne.size;
      const wordTwoSize = wordFrequenciesTwo.size;

      if (wordOneSize < wordTwoSize) {
      for (let key of wordFrequencyMapOne.keys()) {
      if (wordFrequencyMapTwo.has(key)) {
      sum = sum + wordFrequencyMapOne.get(key) *
      wordFrequencyMapTwo.get(key);
      }
      }
      } else {
      for (let key of wordFrequenciesTwo.keys()) {
      if (wordFrequenciesOne.has(key)) {
      sum = sum + wordFrequencyMapOne.get(key) *
      wordFrequencyMapTwo.get(key);
      }
      }
      }
      return sum;
      };


      vector angle = (dot(1, 2)) / Sqrt (dot(1, 1) * dot(2, 2))



      const vectorAngle = (wordFrequencyMapOne, wordFrequencyMapTwo) => {
      const numerator = dotProduct(wordFrequencyMapOne, wordFrequencyMapTwo);
      const denominator = Math.sqrt(dotProduct(wordFrequencyMapOne, wordFrequencyMapOne) * (dotProduct(wordFrequenciesTwo, wordFrequenciesTwo)))
      return numerator / denominator;
      }









      share|improve this question









      New contributor




      user7331530 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      I am looking for the fastest way to find document distance. How can I improve this?



      Split each document into words. replaceAll() is faster than replace()



      String.prototype.replaceAll = function(search, replacement) {
      return this.replace(new RegExp(search, 'g'), replacement);
      };


      Creating word array here:



      const wordsFromDocument = doc => {
      //we care only about alphanumeric characters and space
      return doc.replaceAll(/[^a-zA-Z0-9 ]/g, ``).split(` `);
      };


      count word frequencies (document vectors)



      const wordFrequencies = words => {
      const wordFrequencyMap = new Map();
      for (const word of words) {
      const lowerCaseWord = word.toLowerCase(); //We don't care about case sensitivity. What is faster way to achieve this?
      if (!wordFrequencyMap.has(lowerCaseWord)) {
      wordFrequencyMap.set(lowerCaseWord, 1);
      } else {
      wordFrequencyMap.set(lowerCaseWord, wordFrequencyMap.get(lowerCaseWord) + 1);
      }
      }
      return wordFrequencyMap;
      };


      Compute dot product (& divide).



      const dotProduct = (wordFrequencyMapOne, wordFrequencyMapTwo) => {
      let sum = 0;
      const wordOneSize = wordFrequencyMapOne.size;
      const wordTwoSize = wordFrequenciesTwo.size;

      if (wordOneSize < wordTwoSize) {
      for (let key of wordFrequencyMapOne.keys()) {
      if (wordFrequencyMapTwo.has(key)) {
      sum = sum + wordFrequencyMapOne.get(key) *
      wordFrequencyMapTwo.get(key);
      }
      }
      } else {
      for (let key of wordFrequenciesTwo.keys()) {
      if (wordFrequenciesOne.has(key)) {
      sum = sum + wordFrequencyMapOne.get(key) *
      wordFrequencyMapTwo.get(key);
      }
      }
      }
      return sum;
      };


      vector angle = (dot(1, 2)) / Sqrt (dot(1, 1) * dot(2, 2))



      const vectorAngle = (wordFrequencyMapOne, wordFrequencyMapTwo) => {
      const numerator = dotProduct(wordFrequencyMapOne, wordFrequencyMapTwo);
      const denominator = Math.sqrt(dotProduct(wordFrequencyMapOne, wordFrequencyMapOne) * (dotProduct(wordFrequenciesTwo, wordFrequenciesTwo)))
      return numerator / denominator;
      }






      javascript performance algorithm edit-distance






      share|improve this question









      New contributor




      user7331530 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|improve this question









      New contributor




      user7331530 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|improve this question




      share|improve this question








      edited 12 hours ago









      200_success

      127k15148410




      127k15148410






      New contributor




      user7331530 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 16 hours ago









      user7331530

      11




      11




      New contributor




      user7331530 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      user7331530 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      user7331530 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.



























          active

          oldest

          votes











          Your Answer





          StackExchange.ifUsing("editor", function () {
          return StackExchange.using("mathjaxEditing", function () {
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
          });
          });
          }, "mathjax-editing");

          StackExchange.ifUsing("editor", function () {
          StackExchange.using("externalEditor", function () {
          StackExchange.using("snippets", function () {
          StackExchange.snippets.init();
          });
          });
          }, "code-snippets");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "196"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          convertImagesToLinks: false,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: null,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });






          user7331530 is a new contributor. Be nice, and check out our Code of Conduct.










           

          draft saved


          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f207837%2fdocument-distance-in-javascript%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown






























          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          user7331530 is a new contributor. Be nice, and check out our Code of Conduct.










           

          draft saved


          draft discarded


















          user7331530 is a new contributor. Be nice, and check out our Code of Conduct.













          user7331530 is a new contributor. Be nice, and check out our Code of Conduct.












          user7331530 is a new contributor. Be nice, and check out our Code of Conduct.















           


          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f207837%2fdocument-distance-in-javascript%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Costa Masnaga

          Fotorealismo

          Sidney Franklin